Translating a first-order modal language to relational algebra
نویسنده
چکیده
This paper is about Kripke structures that are 1. inside a relational database. 2. queried with a modal language. At first the modal language that is used is introduced, followed by a definition of the database and relational algebra. Based on these definitions two things are described: 1. a mapping from components of the model structure to a relational database schema and instance. 2. a translation from queries in the modal language to relational algebra queries.
منابع مشابه
A Hybrid Predicate Calculus∗
We present the Hybrid Predicate Calculus (HPC), a hybrid logical system which incorporates a fairly conventional first-order predicate calculus, but which also include elements of modal logic and relational algebra. A special effort has been made to produce a (syntactically and semantically) well-integrated whole, rather than just a disjoint union. Our calculus, from a formal point of view, is ...
متن کاملFirst-Order Queries over Temporal Databases Inexpressible in Temporal Logic
Queries over temporal databases involve references to time. We study diierences between two approaches of including such references into a rst-order query language (e.g., relational calculus): explicit (using typed variables and quantiiers) vs. implicit (using a nite set of modal connectives). We also show that though the latter approach|a rst-order query language with implicit references to ti...
متن کاملIntensional First-Order Logic for P2P Database Systems
The meaning of concepts and views defined over a database ontology can be considered as intensional objects which have a particular extension in a given possible world: for instance in the actual world. Thus, non invasive mapping between completely independent peer databases in a P2P systems can be naturally specified by the set of couples of views, which have the same meaning (intension), over...
متن کاملRelational approach for a logic for order of magnitude qualitative reasoning with negligibility, non-closeness and distance
We present a relational proof system in the style of dual tableaux for a multimodal propositional logic for order of magnitude qualitative reasoning to deal with relations of negligibility, non-closeness, and distance. This logic enables us to introduce the operation of qualitative sum for some classes of numbers. A relational formalization of the modal logic in question is introduced in this p...
متن کاملRelational Approach to XPath Query Optimization
This thesis contributes to the Pathfinder project which aims at creating an XQuery compiler on top of a relational database system. Currently, it is being implemented on top of MonetDB, a main memory database system. For optimization and portability purposes, Pathfinder first compiles an XQuery expression into its own relational algebra, before translating the query into the query language of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0705.3949 شماره
صفحات -
تاریخ انتشار 2007